Maximum flow problem

Results: 146



#Item
41System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
42Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-31 22:48:01
43Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints∗ Christian Bessiere LIRMM, CNRS and U. Montpellier

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints∗ Christian Bessiere LIRMM, CNRS and U. Montpellier

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2010-11-22 06:22:28
44Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang  University of Toronto

Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang University of Toronto

Add to Reading List

Source URL: www.blogscope.net

Language: English - Date: 2012-04-10 15:02:30
45ICS 260 – Fall 2001 – First Midterm  Name: ANSWER KEY

ICS 260 – Fall 2001 – First Midterm Name: ANSWER KEY

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2001-10-18 19:06:29
46CCCG 2009, Vancouver, BC, August 17–19, 2009  Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim  ∗

CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:32:58
47

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:13
48

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:11
49Graph Cuts is a Max-Product Algorithm  Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu

Graph Cuts is a Max-Product Algorithm Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-07-15 18:06:25
50Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a

Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a

Add to Reading List

Source URL: systemsresilience.org

Language: English - Date: 2014-12-15 22:25:12